Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
121	DENV10-H_and_A_Program.indd Add to Reading List Source URL: www.mosrp.uh.edu Language: English - Date: 2016-02-02 14:53:30 Scattering theory Inverse problems Inverse scattering problem Scattering Inverse Born approximation Arthur Weglein
122	Approximation-Guided Evolutionary Multi-Objective Optimization Karl Bringmann1 , Tobias Friedrich1 , Frank Neumann2 , Markus Wagner2 Max-Planck-Institut f¨ur Informatik, Campus E1.4, 66123 Saarbr¨ucken, Germany 2 Schoo Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:26 Mathematical optimization Cybernetics Computational complexity theory Evolution Operations research Multi-objective optimization Algorithm Evolutionary algorithm Approximation algorithm CMA-ES Genetic algorithm Evolutionary computation
123	DYNAMIC SPARSE STATE ESTIMATION USING ℓ1 -ℓ1 MINIMIZATION: ADAPTIVE-RATE MEASUREMENT BOUNDS, ALGORITHMS AND APPLICATIONS João Mota⋆, Nikos Deligiannis⋆♯, Aswin C. Sankaranarayanan†, Volkan Cevher‡ , Miguel Add to Reading List Source URL: www.ee.ucl.ac.uk Language: English - Date: 2015-02-11 09:51:28 Signal processing Control theory Linear algebra Robot control Kalman filter Compressed sensing Sparse approximation State observer Estimation theory Compressed sensing in speech signals
124	Introduction Fractions of Recurrence Operators Algorithms Conclusion and Future Works Chebyshev Expansions for Solutions of Linear Differential Equations Alexandre Benoit, Joint work with Bruno Salvy Add to Reading List Source URL: issac2009.kias.re.kr Language: English - Date: 2009-07-30 00:21:42 Algebra Orthogonal polynomials Approximation theory Chebyshev polynomials Recurrence relation Numerical analysis Chebfun Polynomial Differential equation Integral Pafnuty Chebyshev Chebyshev equation
125	CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-28 14:26:27 NP-complete problems Knapsack problem Set cover problem Steiner tree problem Vertex cover Approximation algorithm Greedy algorithm Dynamic programming Minimum spanning tree Algorithm Time complexity NP
126	A Unified Theory of Granularity, Vagueness, and Approximation Thomas Bittner and Barry Smith Department of Computer Science, Northwestern University, Department of Philosophy, State University of New Y Add to Reading List Source URL: www.acsu.buffalo.edu Language: English - Date: 2004-06-10 06:15:08 Combinatorics Number theory Arithmetic functions Partition of a set Partition Equivalence relation Mathematical object Vagueness Perception Mereology
127	JMLR: Workshop and Conference Proceedings vol 40:1–19, 2015 A PTAS for Agnostically Learning Halfspaces Amit Daniely AMIT. DANIELY @ MAIL . HUJI . AC . IL Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:35 Computational complexity theory Approximation algorithm
128	1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-24 10:52:24 Complexity classes PSPACE-complete IP Generalized geography PSPACE PP ArthurMerlin protocol Computational complexity theory NP P NEXPTIME Reduction
129	Speeding Up Many-Objective Optimization by Monte Carlo Approximations Karl Bringmanna , Tobias Friedrichb,∗, Christian Igelc , Thomas Voßd a Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:08 Mathematical optimization Operations research Computational complexity theory Evolution Multi-objective optimization CMA-ES Approximation algorithm Exact algorithm Multiple-criteria decision analysis Algorithm Evolutionary algorithm Pareto efficiency
130	BEST APPROXIMATIONS IN L1 ARE NEAR BEST IN Lp , p < 1 LAWRENCE G. BROWN AND BRADLEY J. LUCIER (Communicated by J. Marshall Ash) Abstract. We show that any best L1 polynomial approximation to a function f in Lp , 0 < p < Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2005-08-03 19:09:30 Differentiation rules Functions and mappings Ordinary differential equations Mathematical identities Integral calculus Product rule SturmLiouville theory

UPDATE